QIP Note: On the Quantum Fourier Transform and Applications
نویسنده
چکیده
This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any efficiently computable periodic function. This in particular implies an efficient quantum algorithm for factoring. In the appendix we show how this generalizes to solving the hidden subgroup problem in any Abelian group. Efficient quantum algorithms for discrete log (and factoring) follow as special cases.
منابع مشابه
pH Effect on the Size of Graphene Quantum dot Synthesized by Using Pulse Laser Irradiation
In this study graphene oxide (GO) was synthesized by using Hummer’s method. Low dimension graphene quantum dot nanoparticles (GQDs) were synthesized using pulse laser irradiation. Fourier Transform-Infrared Spectroscopy (FTIR), Ultraviolet-Visible (UV-Vis) spectroscopy and photoluminescence (PL) analysis were applied to study the GQDs characteristic. Scanning electron microscopy illustrated the...
متن کاملUltrafast sources of entangled photons for quantum information processing
Recent advances in quantum information processing (QIP) have enabled practical applications of quantum mechanics in various fields such as cryptography, computation, and metrology. Most of these applications use photons as carriers of quantum information. Therefore, engineering the quantum state of photons is essential for the realization of novel QIP schemes. A practical and flexible technique...
متن کاملWhy Quantum Information Processing
In this brief note, I will consider the following questions: (1) What is QIP? (2) Why QIP is interesting? (3) What QIP can do? (4) What QIP cannot do? (5) What are the major challenges in QIP? Some guest lecturers may also be invited for special topics on the subject.
متن کاملApplications of Multi-Valued Quantum Algorithms
This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to n-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, but can also find closed expressions for classes of affine logical functions in quantum oracles, accurate to a constant term. Furth...
متن کاملEquivalence of K-functionals and modulus of smoothness for fourier transform
In Hilbert space L2(Rn), we prove the equivalence between the mod-ulus of smoothness and the K-functionals constructed by the Sobolev space cor-responding to the Fourier transform. For this purpose, Using a spherical meanoperator.
متن کامل